منابع مشابه
Distance-regular Cayley graphs on dihedral groups
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
متن کاملON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS
Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.
متن کاملCritical Groups of Some Regular Line Graphs
We describe the critical group of the line graph of the complete bipartite graph Kp,q . Data is presented that describes the structure of the critical group of some regular line graphs in terms of the critical group of the original graph. This suggests the existence of a large class of regular graphs with such a property.
متن کاملOn the Automorphism Groups of Strongly Regular Graphs
We derive strong structural constraints on the automorphism groups of strongly regular (s. r.) graphs, giving a surprisingly strong answer to a decades-old problem, with tantalizing implications to testing isomorphism of s. r. graphs, and raising new combinatorial challenges. S. r. graphs, while not believed to be Graph Isomorphism (GI) complete, have long been recognized as hard cases for GI, ...
متن کاملOn the Automorphism Groups of Strongly Regular Graphs II
We derive strong constraints on the automorphism groups of strongly regular (SR) graphs, resolving old problems motivated by Peter Cameron’s 1981 description of large primitive groups. Trivial SR graphs are the disjoint unions of cliques of equal size and their complements. Graphic SR graphs are the line-graphs of cliques and of regular bipartite cliques (complete bipartite graphs with equal pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1975
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90082-9